A finite concave minimization algorithm using branch and bound and neighbor generation
نویسندگان
چکیده
منابع مشابه
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
In this paper, we develop a simplicial branch-and-bound algorithm for generating globally optimal solutions to concave minimization problems with low rank nonconvex structures. We propose to remove all additional constraints imposed on the usual linear programming relaxed problem. Therefore, in each bounding operation, we solve a linear programming problem whose constraints are exactly the same...
متن کاملA Branch and Bound Algorithm for Separable Concave Programming
In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision(NRS). Numerical tests on problems with dimensions...
متن کاملA branch and bound algorithm for the matrix bandwidth minimization
In this article we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This NP-complete problem can also be formulated as a labeling o...
متن کاملA New Finite Cone Covering Algorithm for Concave Minimization
We propose a new nite cone covering algorithm for concave minimization over a polytope, in which the cones are de ned by extreme points of the polytope. The main novelties are the use of cones de ned by an arbitrary number of edges, and the subdivision process. This latter is shown to have a \descent property", i.e., all subcones are strictly better in some sense than the subdivided cone, which...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 1994
ISSN: 0925-5001,1573-2916
DOI: 10.1007/bf01096999